Multiple Objectives Mathematical Programming Using Payoff Techniques

نویسندگان

  • Amanpreet Singh
  • Sandeep Kumar
چکیده

Optimization is a decision Science which helps managements to take better decisions and refers to finding the values of decision (or free) variables. It is ubiquitous in daily life people use optimization, often without actually realizing, for simple things such as traveling from one place to another and time management, as well as for major decisions such as finding the best combination of study, job and investment. Similarly, optimization finds many applications in engineering, science, business, economics, etc. except that, in these applications, quantitative models and methods are employed unlike qualitative assessment of choices in daily life. Without optimization of design and operations, manufacturing and engineering activities will not be as efficient as they are now. Even then, scope still exists for optimizing the current industrial operations, particularly with the ever changing economic, energy and environmental landscape. Mostly we have three methods priori, interactive and a posteriori, according to the decision stage in which the decision maker expresses his/her preferences. Although the a priori methods are the most popular, the interactive and the a-posteriori methods convey much more information to the decision maker. Especially, the a-posteriori (or generation) methods inform the Decision Maker (DM) about the whole context of the decision alternatives before his/her final decision. However, the generation methods are the less popular due to their computational effort and the lack of widely available software. The basic step towards further penetration of the generation methods in MMP applications, is to provide appropriate codes for Mathematical Programming (MP) solvers that are widely used by people in engineering, economics, agriculture etc. The present work is related with the Payoff Matrix and augmented ε -constraint method in which the Decision Maker (DM) plays important roll. Finally a program to find the Payoff Matrix have been designed .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Criteria Decision Making Combined with VRP: A Categorized Bibliographic Study

In this research author reviews references related to the topic of multi criterion (goal programming, multiple objective linear and nonlinear programming, bi-criterion programming, Multi Attribute Decision Making, Compromise Programming, Surrogate Worth Trade-off Method) and various versions of vehicle routing problem (VRP), Multi depot VRP (MDVRP), VRP with time windows (VRPWTW), Stochastic VR...

متن کامل

Bi-objectives Approach for a Multi-period Two Echelons Perishable Product Inventory-routing Problem with Production and Lateral Transshipment

In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...

متن کامل

A Chance Constrained Multiple Objective Goal Programming Model of Fuzzy QFD and FMEA: Model Development

There are varieties of QFD combination forms available that can help management to choose the right model for his/her types of problem. The proposed MOCC-QFD-FMEA model is a right model to include variety of objectives as well as the risk factors into the model of the problem. Due to the fact that the model also takes into consideration the concept of Fuzzy set, it further allows management...

متن کامل

Network Planning Using Iterative Improvement Methods and Heuristic Techniques

The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012